Deterministic and stochastic scheduling
نویسندگان
چکیده
منابع مشابه
Deterministic, Stochastic, and Robust Cost-Aware Scheduling
Scheduling concerns the temporal allocation of tasks to scarce resources with the objective of optimizing some performance measure subject to certain side constraints. It is involved for example when the execution of a computer program is assigned to the central processing unit (CPU) or when the take-offs and landings of airplanes are allocated to the runways of an airport. Classical scheduling...
متن کاملScheduling Aircraft Landings Dynamically Using Stochastic and Deterministic Elements
The characteristics of a dynamic implementation of the single-runway aircraft landing problem were analysed using some well-known datasets. Given the nature and degree of complexity of this problem, a specific hybrid algorithm was developed, consisting of a stochastic and a deterministic element. The deterministic scheduler divides the aircraft into logical landing sequences as part of the recu...
متن کاملDeterministic and Stochastic Models for Practical Scheduling Problems
This dissertation analyzes three scheduling problems motivated by real life situations. In many manufacturing and service industries, scheduling is an important decision-making process. Unfortunately, scheduling problems are often computationally challenging to solve, and even modeling a scheduling problem can be difficult. Chapter 2 considers single-facility non-preemptive scheduling problems ...
متن کاملA stochastic model for project selection and scheduling problem
Resource limitation in zero time may cause to some profitable projects not to be selected in project selection problem, thus simultaneous project portfolio selection and scheduling problem has received significant attention. In this study, budget, investment costs and earnings are considered to be stochastic. The objectives are maximizing net present values of selected projects and minimizing v...
متن کاملFunctionally Deterministic Scheduling
The aim of this paper is to prove that the question “is a scheduling functionally deterministic for a given set of periodic real time tasks and a given conservative scheduling policy” is decidable. For thar purpose, we encode the tasks and the scheduler by an acyclic stopwatch automaton. We show then that the previous question can be encoded by a decidable reachability problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1985
ISSN: 0001-8708
DOI: 10.1016/0001-8708(85)90069-6